Fully Abstract Game Semantics for Actors
نویسنده
چکیده
Along the way paved by the recent concurrent game semantics for process algebra CCS and π-calculus, based on the basic characteristics of the actor computational model and the very reductive semantics for actors, we establish a fully abstract concurrent game semantics for actors by borrowing the algebraic structure from CCS. This semantics can both be seen as an innocent presheaf semantics, and a concurrent game semantics.
منابع مشابه
Synchronous Game Semantics via Round Abstraction
A synchronous game semantics—one in which several moves may occur simultaneously—is derived from a conventional (sequential) game semantics using a round abstraction algorithm. We choose the programming language Syntactic Control of Interference and McCusker’s fully abstract relational model as a convenient starting point and derive a synchronous game model first by refining the relational sema...
متن کاملComputing Science Group FULL ABSTRACTION FOR NOMINAL EXCEPTIONS AND GENERAL REFERENCES
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names and nominal general references. Here we make a step further by developing a fully abstract semantics for a language with nominal...
متن کاملFully-abstract concurrent games for pi
We define a semantics for Milner’s pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covered variants of bisimilarity and the may and must testing equivalences. Second, it is based on reduction semantics, whereas previous semantics were based on labelled transition systems. Finally, it has a strong game sem...
متن کاملFully-abstract concurrent games for π
We define a semantics for Milner’s pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covered variants of bisimilarity and the may and must testing equivalences. Second, it is based on reduction semantics, whereas previous semantics were based on labelled transition systems. Finally, it has a strong game sem...
متن کاملThe Regular-Language Semantics of First-Order Idealized Algol
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for first order IA taken as a stand-alone languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.6563 شماره
صفحات -
تاریخ انتشار 2014